1780D - Bit Guessing Game - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
 
//#include <ext/pb_ds/assoc_container.hpp> 
//#include <ext/pb_ds/tree_policy.hpp> 
//using namespace __gnu_pbds; 
//https://codeforces.com/blog/entry/11080
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
//#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//#define endl "\n"
#define ll long long
#define f first
#define s second
#define pb push_back
#define all(v) v.begin(), v.end()
#define lb lower_bound
#define ub upper_bound
#define pii pair<int,int>
#define pll pair<ll, ll>
#define lui long unsigned int
//#define popcount(x)  __builtin_popcountll(x)
//#define uniq(a) a.erase(unique(all(a)),a.end())
#define mp make_pair
//#define int long long

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x<<" "; _print(x); cerr << endl;
#else
#define debug(x);
#endif

void _print(ll t) {cerr << t;}
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(double t) {cerr << t;}
 
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.f); cerr << ","; _print(p.s); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
 
const int N = 1000005;
const ll MOD = 1e9 + 7;
const ll MOD1 = 998244353;
const ll INF = 1e18;
 
ll qpow(ll a, ll b, ll m){ ll  ans=1; while(b){ if(b&1) ans=(ans*a)%m; b/=2; a=(a*a)%m; } return ans; }

void solve(){
  int ans = 0;
  int ct;
  cin >> ct;
  int oct = ct, t = ct;
  int rem = 0, d = 0, x;

  while(t--){
    cout << "- " << rem + 1 << endl;
    cin >> ct;
    if(ct < oct){
      ans = 1;
      oct = ct;
      continue;
    }
    x = ct - oct + d + 1;
    ans |= (1<<x);
    d = x;
    rem = (1<<x) - 1;
    oct = ct;
  }

  cout << "! " << ans;
}

int main()
{

#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("error.txt", "w", stderr);
    freopen("output.txt", "w", stdout);
#endif

    //IOS;

    int tt=1; cin>>tt;
    for(int t = 1; t <= tt; t++){
      solve();
////   
      cout << endl;  
    }
    
    return 0;     
}